package com.example.leetcode.graph;

import com.example.leetcode.graph.common.GraphUtils;

class Solution1926 {
    public int nearestExit(char[][] maze, int[] entrance) {
        return GraphUtils.nearestExit(maze, entrance);
    }
}

public class leetcode1926 {
    public static void main(String[] args) {
        Solution1926 solution1926 = new Solution1926();
        char[][] maze = {
                {'+', '+', '.', '+'},
                {'.', '.', '.', '+'},
                {'+', '+', '+', '.'}
        };
        int[] entrance = {1, 2};
        System.out.println(solution1926.nearestExit(maze, entrance));
    }
}
